SSA-based mobile code

Quantifying the Benefits of SSA-Based Mobile Code

High-performance just-in-time compilers for Java need to invest considerable effort before actual code generation can commence. This is in part due to the very nature of the Java Virtual Machine, which is not well matched to the requirements of optimizing code generators. Alternative transportation formats based on Static Single Assignment form should theoretically be superior to virtual machin...

Code Instruction Selection Based on SSA-Graphs

Instruction selection for embedded processors is a challenging problem. Embedded system architectures feature highly irregular instruction sets and complex data paths. Traditional code generation techniques have difficulties to fully utilize the features of such architectures and typically result in inefficient code. In this paper we describe an instruction selection technique that uses static ...

Ssa Pre Ssa Pre Ssa Ssa Cssa Phi Congruence Class Pre Ssa Pre Lazy Code Motion Ssa

Using SSA Form in a Code Optimizer

We have constructed a simple yet powerful code optimizer that uses SSA form in concert with table-driven techniques for peephole optimization and code generation. This paper describes the problems with data dependences and 2-address instructions we encountered in combining these two techniques, and how we solved them.

Secure Prolog Based Mobile Code

LogicWeb mobile code consists of Prolog-like rules embedded in Web pages, thereby adding logic programming behaviour to those pages. Since LogicWeb programs are downloaded from foreign hosts and executed locally, there is a need to protect the client from buggy or malicious code. A security model is crucial for making LogicWeb mobile code safe to execute. This paper presents such a model, which...